Operational Semantics of Reversibility in Process Algebra

نویسندگان

  • Iain C. C. Phillips
  • Irek Ulidowski
چکیده

Reversible computation has a growing number of promising application areas such as the modelling of biochemical systems, program debugging and testing, and even programming languages for quantum computing. We discuss reversibility in major process algebras from the point of view of operational semantics. The main difficulty seems to be with the definitions of forward and reverse computation for the dynamic operators, and we confine ourselves to these, leaving the static operators for further work. We consider a solution where predicates in SOS rules play a vital role.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Orchestration in Orc: A Deterministic Distributed Programming Model

Orc is a new model of distributed programming which provides a strong theoretical foundation for internet computing based on compositions of web-services. Orc combines some of the power and flexibility of process algebra with the simplicity and determinism of synchronous programming models. We present an operational semantics of Orc and prove some laws analogous to those of Kleene algebra. We v...

متن کامل

Testing Semantics for a Probabilistic-Timed Process Algebra

In this paper we present a probabilistic-timed process algebra, which try to unify the best solutions of previous probabilistic and timed algebras. We provide an operational semantics for the new language (PTPA), and from this operational semantics we define a testing semantics based on the probability with which processes pass tests. Afterwards the induced testing equivalence is operationally ...

متن کامل

Process Algebra with Five-Valued Conditions

We propose a five-valued logic that can be motivated from an algorithmic point of view and from a logical perspective. This logic is combined with process algebra. For process algebra with five-valued logic we present an operational semantics in SOS-style and a completeness result. Finally, we discuss some generalizations.

متن کامل

Extended Markovian Process Algebra: A Case Study

Extended Markovian Process Algebra (EMPA) is a process algebra suitable for expressing functional and performance aspects of concurrent systems. It is equipped with an operational interleaving semantics, a functional semantics, a Markovian semantics and an operational net semantics. In this paper we apply an integrated approach based on EMPA for mod-eling and analyzing concurrent systems to the...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Electr. Notes Theor. Comput. Sci.

دوره 162  شماره 

صفحات  -

تاریخ انتشار 2006